How Many Holes Can an Unbordered Partial Word Contain?
نویسندگان
چکیده
Partial words are sequences over a finite alphabet that may have some undefined positions, or “holes,” that are denoted by ’s. A nonempty partial word is called bordered if one of its proper prefixes is compatible with one of its suffixes (here is compatible with every letter in the alphabet); it is called unbordered otherwise. In this paper, we investigate the problem of computing the maximum number of holes a partial word of a fixed length can have and still fail to be bordered.
منابع مشابه
Unbordered partial words
An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of ―do not know‖ symbols. We extend a result of Ehrenfeucht and Silberger which states that if a word u can be written as a concatenation of nonem...
متن کاملFully bordered words
Any primitive binary word contains at least two unbordered conjugates. We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes. In this paper we relate two elementary properties of finite words: being a palin-drome and being unbordered. These two concepts are in a sense complementary. Unbordered words have maxi...
متن کاملAbelian Repetitions in Partial Words∗
We study abelian repetitions in partial words, or sequences that may contain some unknown positions or holes. First, we look at the avoidance of abelian pth powers in infinite partial words, where p > 2, extending recent results regarding the case where p = 2. We investigate, for a given p, the smallest alphabet size needed to construct an infinite partial word with finitely or infinitely many ...
متن کاملFreeness of partial words
The paper approaches the classical combinatorial problem of freeness of words, in the more general case of partial words. First, we propose an algorithm that tests efficiently whether a partial word is kfree or not. Then, we show that there exist arbitrarily many cube-free infinite partial words containing an infinite number of holes, over binary alphabets; thus, there exist arbitrarily many k-...
متن کاملOverlap-freeness in infinite partial words
10 We prove that there exist infinitely many infinite overlap-free binary partial words. 11 Moreover, we show that these words can contain only one hole and the hole must 12 occur either in the first or in the second position. We define that a partial word is 13 k-overlap-free if it does not contain a factor of the form xyxyx where the length 14 of x is at least k. We prove that there exist inf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009